Adjustable Robust Multistage Optimization
ثبت نشده
چکیده
Format (5.1.1) covers all uncertain optimization problems considered so far; moreover, in these latter problems the objective f and the right hand side F of the constraints always were bi-affine in x, ζ, (that is, affine in x when ζ is fixed, and affine in ζ, x being fixed), and K was a “simple” convex cone (a direct product of nonnegative rays/Lorentz cones/Semidefinite cones, depending on whether we were speaking about uncertain Linear, Conic Quadratic or Semidefinite Optimization). We shall come back to this “well-structured” case later; for our immediate purposes the specific conic structure of instances plays no role, and we can focus on “general” uncertain problems in the form of (5.1.1).
منابع مشابه
Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
In this paper, we introduce the extended affinely adjustable robust counterpart to modeling and solving multistage uncertain linear programs with fixed recourse. Our approach first reparameterizes the primitive uncertainties and then applies the affinely adjustable robust counterpart proposed in the literature, in which recourse decisions are restricted to be linear in terms of the primitive un...
متن کاملA dynamic programming approach to adjustable robust optimization
In this paper we consider the adjustable robust approach to multistage optimization, for which we derive dynamic programming equations. We also discuss this from the point of view of risk averse stochastic programming.We consider as an example a robust formulation of the classical inventorymodel and show that, like for the risk neutral case, a basestock policy is optimal. © 2011 Elsevier B.V. A...
متن کاملDynamic programming approach to adjustable robust optimization
In this paper we consider the adjustable robust approach to multistage optimization, for which we derive dynamic programming equations. We also discuss this from a point of view of risk averse stochastic programming. As an example we consider a robust formulation of the classical inventory model and show that, similar to the risk neutral case, a basestock policy is optimal.
متن کاملThe Urban Path Routing Adjustable Optimization by Means of Wavelet Transform and Multistage Genetic Algorithm
This paper introduces the optimization algorithm to improve search rate in urban path routing problems using viral infection and local search in urban environment. This algorithm operates based on two different approaches including wavelet transform and genetic algorithm. The variables proposed by driver such as degree of difficulty and difficulty traffic are of the essence in this technique. W...
متن کاملRobust Energy Cost Optimization of Water Distribution System with Uncertain Demand
A methodology, based on the concept of Affinely Adjustable Robust Optimization, for optimizing daily operation of pumping stations is proposed, which takes into account the fact that a water distribution system in reality is unavoidably affected by uncertainties. For operation control, the main source of uncertainty is the uncertainty in the demand. Traditional methods for optimizing dynamical ...
متن کامل